Dynamic Graph Transformation Systems
نویسندگان
چکیده
We introduce an extension of Graph Grammars (GGs), called Dynamic Graph Grammars (DynGGs), where the right-hand side of a production can spawn fresh parts of the type graph and fresh productions operating on it. The features of DynGGs make them suitable for the straightforward modeling of reflexive mobile systems like dynamic nets and the Join calculus. Our main result shows that each DynGG can be modeled as a (finite) GG, so that the dynamically generated structure can be typed statically, still preserving exactly all derivations.
منابع مشابه
ENTROPY OF DYNAMICAL SYSTEMS ON WEIGHTS OF A GRAPH
Let $G$ be a finite simple graph whose vertices and edges are weighted by two functions. In this paper we shall define and calculate entropy of a dynamical system on weights of the graph $G$, by using the weights of vertices and edges of $G$. We examine the conditions under which entropy of the dynamical system is zero, possitive or $+infty$. At the end it is shown that, for $rin [0,+infty]$, t...
متن کاملA Hybrid Meta-heuristic Approach to Cope with State Space Explosion in Model Checking Technique for Deadlock Freeness
Model checking is an automatic technique for software verification through which all reachable states are generated from an initial state to finding errors and desirable patterns. In the model checking approach, the behavior and structure of system should be modeled. Graph transformation system is a graphical formal modeling language to specify and model the system. However, modeling of large s...
متن کاملSpatial and Temporal Refinement of Typed Graph Transformation Systems
Graph transformation systems support the formal modeling of dynamic, concurrent, and distributed systems. States are given by their graphical structure, and transitions are modeled by graph transformation rules. In this paper we investigate two kinds of reenement relations for graph transformation systems in order to support the development of a module concept for graph transformation systems. ...
متن کاملStatic Analysis of Dynamic Communication Systems
Prominent examples of dynamic communication systems include traffic control systems and ad hoc networks. Dynamic communication systems are hard to verify due to inherent unboundedness. Unbounded creation and destruction of objects and a dynamically evolving communication topology are characteristic features. Partner graph grammars are presented as an adequate specification formalism for dynamic...
متن کاملtype graph G CHOOSE & CHECK REMOVE & GLUE Graph
A new visual design technique for distributed object systems based on graph transformation is presented. It includes the graphical description of remote object interaction, object migration and replication, communication and synchronization as well as dynamic reconnguration of distributed systems. The notation is built up on UML providing these concepts as a possible extension of UML. Using gra...
متن کاملModelling Emergency Scenarios using Algebraic High Level Net Transformation Systems with Net Patterns
Emergency operations are a good case study for dynamic systems. Their size and high dynamicity make modelling them a challenging task. Algebraic high level net transformation systems are a well suited technique for modelling such dynamic systems. They consist of an algebraic high level net and a set of graph transformation rules. The net reflects the initial state of the operation and the trans...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006